From metagrammars to factorized TAG/TIG parsers
نویسنده
چکیده
This document shows how the factorized syntactic descriptions provided by MetaGrammars coupled with factorization operators may be used to derive compact large coverage tree adjoining grammars.
منابع مشابه
Algoritmos de análisis para gramáticas de inserción de árboles
Tree Insertion Grammar (TIG) is a compromise between Context Free Grammar (CFG) and Tree Adjoining Grammar (TAG) that can be parsed in O(n3)− time. In the literature, just two parsers for TIGs have been defined, based on the well-known CYK and Earley algorithms for CFGs. In this paper, we define four new parsers for TIGs: three parsers use a bottom-up strategy and the other one uses a predictiv...
متن کاملVariants of mixed parsing of TAG and TIG
Tree Adjoining Grammar (TAG) is a useful formalism for describing the syntactic structure of natural languages. In practice, a large part of wide coverage TAGs is formed by trees that satisfy the restrictions imposed by Tree Insertion Grammar (TIG), a simpler formalism. This characteristic can be used to reduce the practical complexity of TAG parsing, applying the standard adjunction operation ...
متن کاملParsing Tree Adjoining Grammars and Tree Insertion Grammars with Simultaneous Adjunctions
A large part of wide coverage Tree Adjoining Grammars (TAG) is formed by trees that satisfy the restrictions imposed by Tree Insertion Grammars (TIG). This characteristic can be used to reduce the practical complexity of TAG parsing, applying the standard adjunction operation only in those cases in which the simpler cubic-time TIG adjunction cannot be applied. In this paper, we describe a parsi...
متن کاملGenerating XTAG Parsers from Algebraic Specifications
In this paper, a generic system that generates parsers from parsing schemata is applied to the particular case of the XTAG English grammar. In order to be able to generate XTAG parsers, some transformations are made to the grammar, and TAG parsing schemata are extended with feature structure unification support and a simple tree filtering mechanism. The generated implementations allow us to stu...
متن کاملMetagrammars: a new implementation for FTAG
This paper describes work on creating elementary trees for adjective and predicative noun families (Barrier, 2002; Barrier and Barrier, 2003) using Metagrammars, for the FTAG grammar (Abeillé, 1991; Abeillé, 2002). Based on the Candito’s work on Metagrammars (Candito, 1996; Candito, 1999a), it adds a fourth dimension, specially designed for word order specification. 1 The metagrammar compiler M...
متن کامل